Algebraization, Parametrized Local Deduction Theorem and Interpolation for Substructural Logics over FL
نویسندگان
چکیده
منابع مشابه
Substructural Logics over Fl I: Algebraization, Parametrized Local Deduction Theorem and Interpolation
Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation pro...
متن کاملGlivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko’s theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko’s theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via ...
متن کاملFregean logics with the multiterm deduction theorem and their algebraization
A deductive system S (in the sense of Tarski) is Fregean if the relation of interderivability, relative to any given theory T , i.e., the binary relation between formulas { 〈α, β〉 : T, α `S β and T, β `S α }, is a congruence relation on the formula algebra. The multiterm deduction-detachment theorem is a natural generalization of the deduction theorem of the classical and intuitionistic proposi...
متن کاملNikolaos Galatos
Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation pro...
متن کاملLabelled Natural Deduction for Substructural Logics
In this paper a uniform methodology to perform Natural Deduction over the family of linear, relevance and intuitionistic logics is proposed. The methodology follows the Labelled Deductive Systems (LDS) discipline, where the deductive process manipulates declarative units { formulas labelled according to a labelling algebra. In the system described here, labels are either ground terms or variabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2006
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-006-8305-5